Vulnerability Evaluation of Proportional Fairness Scheduling to Retransmissions Attacks

Channel aware schedulers of modern wireless networks such as the popular Proportional Fairness Scheduler (PFS) improve throughput performance by exploiting channel uctuations while maintaining fairness among the users. In order to simplify the analysis, PFS was introduced and vastly investigated in a model where frame losses do not occur, which is of course not the case in practical wireless networks. Recent studies focused on the e ciency of various implementations of PFS in a realistic model where frame losses can occur. Ben-Porat et al. [1] proved the immunity and fairness of their proposed variations to PFS by analytical analysis. In this work we back up these claims by simulation results. In addition we investigate two other aspects of the system: a) We compare the e ciency and vulnerability of the proposed solutions when used with di erent error correcting methods. b) We measure the transmission latency and propose a new solution to improve latency without compromising fairness or immunity.